Evaluation of Algorithms for Randomizing Key Item Locations in Game Worlds

In the past few years, game randomizers have become increasingly popular. general, a randomizer takes some aspect of that is usually static and shuffles it somehow. particular, in this paper we will discuss type locations items where certain key are needed to traverse world access these locations. Examples types games include series such as The Legend Zelda xmlns:xlink="http://www.w3.org/1999/xlink">Metroid . order accomplish shuffling way player able reach end game, novel algorithms graph theory must be utilized, its item represented each edge on has rule for which required it. paper, define formally evaluate them with different metrics can guide developer’s decision about algorithm works best their game.